On finding minimal, maximal, and consistent sequences over a binary alphabet
نویسندگان
چکیده
منابع مشابه
On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet
In this paper we investigate the complexity of finding various kinds of common superand subsequences with respect to one or two given sets of strings. We show that Longest Minimal Common Supersequence, Shortest Maximal Common Subsequence, and Shortest Maximal Common Non-Supersequence are MAX SNP-hard over a binary alphabet. Moreover, we show that Shortest Common Supersequence, Longest Common Su...
متن کاملOn the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences
In this paper we investigate the complexity of nding various kinds of common super-and subsequences with respect to one or two given sets of strings. We show how these problems can be related to nding sequences having a xed character composition. This leads to a uniied approach for characterizing the complexity of such problems. Moreover , we derive interesting results on the approximability of...
متن کاملFinding Minimal Multiple Generalization over Regular Patterns with Alphabet Indexing
We propose a learning algorithm that discovers a motif represented by patterns and an alphabet indexing from biosequences. From only positive examples with the help of an alphabet indexing, the algorithm nds k regular patterns as a k-minimal multiple generalization (k-mmg for short). The computational results for transmembrane domains indicate that the combination of k-mmg and alphabet indexing...
متن کاملComplexity of Substitutive Sequences - Calculation of the Complexities of Substitutive Sequences Over a Binary Alphabet
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula determined by the characteristic polynomial.
متن کاملFaster Algorithms for Finding Minimal Consistent DFAs
We describe exbar, a powerful new algorithm for the exact inference of minimal deterministic automata from given training data. This algorithm achieves the highest performance ever on a set of graded benchmark problems that has been posted by Arlindo Oliveira. In addition, we note that the inexact program ed-beam, which resulted from the Abbadingo DFA learning competition, also does well on thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00014-n